On sums and convex combinations of projectors onto convex sets
نویسندگان
چکیده
منابع مشابه
Convex Sets and Convex Combinations
Convexity is one of the most important concepts in a study of analysis. Especially, it has been applied around the optimization problem widely. Our purpose is to define the concept of convexity of a set on Mizar, and to develop the generalities of convex analysis. The construction of this article is as follows: Convexity of the set is defined in the section 1. The section 2 gives the definition...
متن کاملConvex Sets and Convex Combinations on Complex Linear Spaces
Let V be a non empty zero structure. An element of Cthe carrier of V is said to be a C-linear combination of V if: (Def. 1) There exists a finite subset T of V such that for every element v of V such that v / ∈ T holds it(v) = 0. Let V be a non empty additive loop structure and let L be an element of Cthe carrier of V . The support of L yielding a subset of V is defined by: (Def. 2) The support...
متن کاملConsecutive projections onto convex sets.
In this note we describe and evaluate the performance of a novel approach to information recovery that involves consecutive projection onto convex sets (POCS). The method is applied to a time series of medical image data and the results are compared to images reconstructed using the standard POCS reconstruction method. The consecutive POCS method converges in a desired step-wise manner producin...
متن کاملProjections onto convex sets on the sphere
In this paper some concepts of convex analysis are extended in an intrinsic way from the Euclidean space to the sphere. In particular, relations between convex sets in the sphere and pointed convex cones are presented. Several characterizations of the usual projection onto a Euclidean convex set are extended to the sphere and an extension of Moreau’s theorem for projection onto a pointed convex...
متن کاملMesh Watermarking Using Projection onto Convex Sets
The current paper proposes 3D mesh watermarking using projection onto convex sets. As such, a 3D mesh is iteratively projected onto two constraint convex sets until the convergence condition is satisfied. The sets consist of a robustness set and invisibility set designed to embed the watermark. The watermark can be extracted without the original mesh using the decision values and index that the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Approximation Theory
سال: 2019
ISSN: 0021-9045
DOI: 10.1016/j.jat.2019.02.001